f(x, f(a, f(f(a, a), a))) → f(f(a, x), x)
↳ QTRS
↳ DependencyPairsProof
f(x, f(a, f(f(a, a), a))) → f(f(a, x), x)
F(x, f(a, f(f(a, a), a))) → F(f(a, x), x)
F(x, f(a, f(f(a, a), a))) → F(a, x)
f(x, f(a, f(f(a, a), a))) → f(f(a, x), x)
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
F(x, f(a, f(f(a, a), a))) → F(f(a, x), x)
F(x, f(a, f(f(a, a), a))) → F(a, x)
f(x, f(a, f(f(a, a), a))) → f(f(a, x), x)
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
F(x, f(a, f(f(a, a), a))) → F(a, x)
Used ordering: Polynomial interpretation [25,35]:
F(x, f(a, f(f(a, a), a))) → F(f(a, x), x)
The value of delta used in the strict ordering is 1/16.
POL(a) = 0
POL(f(x1, x2)) = 1/4
POL(F(x1, x2)) = (1/4)x_1 + (1/4)x_2
f(x, f(a, f(f(a, a), a))) → f(f(a, x), x)
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
↳ QDP
F(x, f(a, f(f(a, a), a))) → F(f(a, x), x)
f(x, f(a, f(f(a, a), a))) → f(f(a, x), x)